Efficient approximation of diagonal unitaries over the Clifford+T basis
نویسندگان
چکیده
We present an algorithm for the approximate decomposition of diagonal operators, focusing specifically on decompositions over the Clifford+T basis, that minimize the number of phase-rotation gates in the synthesized approximation circuit. The equivalent T -count of the synthesized circuit is bounded by k C0 log2(1/ε) +E(n, k), where k is the number of distinct phases in the diagonal n-qubit unitary, ε is the desired precision, C0 is a quality factor of the implementation method (1 < C0 < 4), and E(n, k) is the total entanglement cost (in T gates). We determine an optimal decision boundary in (k, n, ε)-space where our decomposition algorithm achieves lower entanglement cost than previous state-of-the-art techniques. Our method outperforms state-of-the-art techniques for a practical range of ε values and diagonal operators and can reduce the number of T gates exponentially in n when k << 2.
منابع مشابه
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates
In this paper, we show the equivalence of the set of unitaries computable by the circuits over the Clifford and T library and the set of unitaries over the ring Z[ 1 √ 2 , i], in the single-qubit case. We report an efficient synthesis algorithm, with an exact optimality guarantee on the number of Hadamard and T gates used. We conjecture that the equivalence of the sets of unitaries implementabl...
متن کاملExact Synthesis of Single-qubit Unitaries over Clifford-cyclotomic Gate Sets
We generalize an efficient exact synthesis algorithm for single-qubit unitaries over the Clifford+T gate set which was presented by Kliuchnikov, Maslov and Mosca. Their algorithm takes as input an exactly synthesizable single-qubit unitary–one which can be expressed without error as a product of Clifford and T gates–and outputs a sequence of gates which implements it. The algorithm is optimal i...
متن کاملA Framework for Approximating Qubit Unitaries
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves ε-approximations using circuits of length O(log(1/ε)), which is asymptotically optimal. The algorithm achieves the same quality of approximation as previously-known algorithms for Clifford+T [arXiv:1212.6253], V-basis [arXiv:1303.1411] and Cliffo...
متن کاملImproved Quantum Ternary Arithmetics
Qutrit (or ternary) structures arise naturally in many quantum systems, notably in certain non-abelian anyon systems. We present efficient circuits for ternary reversible and quantum arithmetics. Our main result is the derivation of circuits for two families of ternary quantum adders. The main distinction from the binary adders is a richer ternary carry which leads potentially to higher resourc...
متن کاملA framework for exact synthesis
Exact synthesis is a tool used in algorithms for approximating an arbitrary qubit unitary with a sequence of quantum gates from some finite set. These approximation algorithms find asymptotically optimal approximations in probabilistic polynomial time, in some cases even finding the optimal solution in probabilistic polynomial time given access to an oracle for factoring integers. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Quantum Information & Computation
دوره 16 شماره
صفحات -
تاریخ انتشار 2016